Towards fast and accurate algorithms for processing fuzzy data: interval computations revisited
نویسندگان
چکیده
In many practical applications, we need to process data – e.g., to predict the future values of different quantities based on their current values. Often, the only information that we have about the current values comes from experts, and is described in informal (“fuzzy”) terms like “small”. To process such data, it is natural to use fuzzy techniques, techniques specifically designed by Lotfi Zadeh to handle such informal information. In this survey, we start by revisiting the motivation behind Zadeh’s formulas for processing fuzzy data, explain how the algorithmic problem of processing fuzzy data can be described in terms of interval computations (α-cuts). Many fuzzy practitioners claim “I tried interval computations, they did not work” – meaning that they got estimates which are much wider than the desired α-cuts. We show that such statements are usually based on a (widely spread) misunderstanding – that interval computations simply means replacing each arithmetic operation with the corresponding operation with intervals. We show that while such straightforward interval techniques indeed often lead to over-wide estimates, the current advanced interval computations techniques result in estimates which are much more accurate. We overview such advanced interval computations techniques, and show that by using them, we can efficiently and accurately process fuzzy data. We wrote this survey with three audiences in mind. First, we want fuzzy researchers and practitioners to understand the current advanced interval computations techniques and to use them to come up with faster and more accurate algorithms for processing fuzzy data. For this “fuzzy” audience, we explain these current techniques in detail. Second, we also want interval researchers to better understand this important application area for their techniques. For this “interval” audience, we want to explain where fuzzy techniques come from, what are possible variants of these techniques, and what are the problems to which interval techniques can be applied. These readers needs to avoid their own frequent misunderstanding – that fuzzy techniques are “magical” heuristic tools that are only justified by intuition and that have no mathematical justification. Readers of both types can skip the parts they already know. Finally, we also want to target people who solve practical data processing problems – and who may not be well familiar neither with the fuzzy nor with the interval techniques. We want these readers to get an understanding of both the problem of processing fuzzy data and of the interval techniques for solving this problem.
منابع مشابه
Fast Quantum Algorithms for Handling Probabilistic, Interval, and Fuzzy Uncertainty
We show how quantum computing can speed up computations related to processing probabilistic, interval, and fuzzy uncertainty.
متن کاملHigh Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation
Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...
متن کاملHigh Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation
Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...
متن کاملFast convolution and Fast Fourier Transform under interval and fuzzy uncertainty
Convolution y(t) = ∫ a(t− s) ·x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, where n is the number of observations x(t0), . . . , x(tn−1). It is well known that by using the Fast Fourier Transform (FFT) algorithm, we can compute convolution much faster, with computation time O(n · log(n)). In practi...
متن کاملModification of the Fast Global K-means Using a Fuzzy Relation with Application in Microarray Data Analysis
Recognizing genes with distinctive expression levels can help in prevention, diagnosis and treatment of the diseases at the genomic level. In this paper, fast Global k-means (fast GKM) is developed for clustering the gene expression datasets. Fast GKM is a significant improvement of the k-means clustering method. It is an incremental clustering method which starts with one cluster. Iteratively ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. General Systems
دوره 42 شماره
صفحات -
تاریخ انتشار 2013